Stationary logic

Stationary Sets and Infinitary Logic

Let K0 λ be the class of structures 〈λ,<,A〉, where A ⊆ λ is disjoint from a club, and let K1 λ be the class of structures 〈λ,<,A〉, where A ⊆ λ contains a club. We prove that if λ = λ is regular, then no sentence of Lλ+κ separates K 0 λ and K 1 λ. On the other hand, we prove that if λ = μ+, μ = μ, and a forcing axiom holds (and א1 = א1 if μ = א0), then there is a sentence of Lλλ which separates ...

Stationary Generated Models of Generalized Logic Programs

The interest in extensions of the logic programming paradigm beyond the class of normal logic programs is motivated by the need of an adequate representation and processing of knowledge. One of the most difficult problems in this area is to find an adequate declarative semantics for logic programs. In the present paper a general preference criterion is proposed that selects the ‘intended’ parti...

Stationary Semantics for Normal and Disjunctive Logic Programs

Projected non-stationary simultaneous iterative methods

In this paper, we study Projected non-stationary Simultaneous It-erative Reconstruction Techniques (P-SIRT). Based on algorithmic op-erators, convergence result are adjusted with Opial’s Theorem. The advantages of P-SIRT are demonstrated on examples taken from to-mographic imaging.

TOPOLOGICALLY STATIONARY LOCALLY COMPACT SEMIGROUP AND AMENABILITY

In this paper, we investigate the concept of topological stationary for locally compact semigroups. In [4], T. Mitchell proved that a semigroup S is right stationary if and only if m(S) has a left Invariant mean. In this case, the set of values ?(f) where ? runs over all left invariant means on m(S) coincides with the set of constants in the weak* closed convex hull of right translates of f. Th...